SHORT SEED EXTRACTORS AGAINST QUANTUM STORAGETA-SHMA, Amnon.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 664-677, issn 0097-5397, 14 p.Article

On benefits and drawbacks of aging strategies for randomized search heuristicsJANSEN, Thomas; ZARGES, Christine.Theoretical computer science. 2011, Vol 412, Num 6, pp 543-559, issn 0304-3975, 17 p.Article

On the computational complexity of behavioral description-based web service compositionWONHONG NAM; HYUNYOUNG KIL; DONGWON LEE et al.Theoretical computer science. 2011, Vol 412, Num 48, pp 6736-6749, issn 0304-3975, 14 p.Article

Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithmJAICAR, Petr.Information and computation (Print). 2008, Vol 206, Num 11, pp 1259-1263, issn 0890-5401, 5 p.Article

When not losing is better than winning : Abstraction and refinement for the full μ-calculusGRUMBERG, Orna; LANGE, Martin; LEUCKER, Martin et al.Information and computation (Print). 2007, Vol 205, Num 8, pp 1130-1148, issn 0890-5401, 19 p.Article

A fast algorithm for multiplying min-sum permutationsSAKAI, Yoshifumi.Discrete applied mathematics. 2011, Vol 159, Num 17, pp 2175-2183, issn 0166-218X, 9 p.Article

Capacitated domination faster than 0 (2ⁿ)CYGAN, Marek; PILIPCZUK, Marcin; ONUFRY WOJTASZCZYK, Jakub et al.Information processing letters. 2011, Vol 111, Num 23-24, pp 1099-1103, issn 0020-0190, 5 p.Article

Connected searching of weighted treesDERENIOWSKI, Dariusz.Theoretical computer science. 2011, Vol 412, Num 41, pp 5700-5713, issn 0304-3975, 14 p.Article

ON THE STABLE PATHS PROBLEMHAXELL, P. E; WILFONG, G. T.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1137-1152, issn 0895-4801, 16 p.Article

On a labeling problem in graphsCHANDRASEKARAN, R; DAWANDE, M; BAYSAN, M et al.Discrete applied mathematics. 2011, Vol 159, Num 8, pp 746-759, issn 0166-218X, 14 p.Article

Treewidth computations II. Lower boundsBODLAENDER, Hans L; KOSTER, Arie M. C. A.Information and computation (Print). 2011, Vol 209, Num 7, pp 1103-1119, issn 0890-5401, 17 p.Article

Nature-inspired framework for measuring visual image resemblance: A near rough set approachRAMANNA, Sheela; MEGHDADI, Amir H; PETERS, James F et al.Theoretical computer science. 2011, Vol 412, Num 42, pp 5926-5938, issn 0304-3975, 13 p.Article

Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristicsMINMING LI.Theoretical computer science. 2011, Vol 412, Num 32, pp 4074-4080, issn 0304-3975, 7 p.Conference Paper

Do We Think With Our Brains? : Philosophie, Technologie et CognitionKARLSSON, Mikael M.Intellectica (Orsay.1985). 2010, Num 53-54, pp 67-94, issn 0769-4113, 28 p.Article

Matching interdictionZENKLUSEN, Rico.Discrete applied mathematics. 2010, Vol 158, Num 15, pp 1676-1690, issn 0166-218X, 15 p.Article

Models and quantifier elimination for quantified Horn formulas : Boolean and pseudo-Boolean functionsBUBECK, Uwe; BUNING, Hans Kleine.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1606-1622, issn 0166-218X, 17 p.Article

Generalised graph colouring by a hybrid of local search and constraint programmingPRESTWICH, Steven.Discrete applied mathematics. 2008, Vol 156, Num 2, pp 148-158, issn 0166-218X, 11 p.Article

Monotonicity of non-deterministic graph searchingMAZOIT, Frédéric; NISSE, Nicolas.Theoretical computer science. 2008, Vol 399, Num 3, pp 169-178, issn 0304-3975, 10 p.Article

Symbolic protocol analysis for monoidal equational theoriesDELAUNE, Stéphanie; LAFOURCADE, Pascal; LUGIEZ, Denis et al.Information and computation (Print). 2008, Vol 206, Num 2-4, pp 312-351, issn 0890-5401, 40 p.Conference Paper

One-unambiguity of regular expressions with numeric occurrence indicatorsKILPELÄINEN, Pekka; TUHKANEN, Rauno.Information and computation (Print). 2007, Vol 205, Num 6, pp 890-916, issn 0890-5401, 27 p.Article

A steepest descent method for vector optimizationGRANA DRUMMOND, L. M; SVAITER, B. F.Journal of computational and applied mathematics. 2005, Vol 175, Num 2, pp 395-414, issn 0377-0427, 20 p.Article

On the convergence of the restrictive Padé approximation to the exact solutions of IBVP of parabolic and hyperbolic typesISMAIL, Hassan N. A.Applied mathematics and computation. 2005, Vol 162, Num 3, pp 1055-1064, issn 0096-3003, 10 p.Article

On the mixed binary goal programming problemsCHANG, Ching-Ter.Applied mathematics and computation. 2004, Vol 159, Num 3, pp 759-768, issn 0096-3003, 10 p.Article

A note on improving the performance of approximation algorithms for radiation therapyBIEDL, Therese; DUROCHER, Stephane; HOOS, Holger H et al.Information processing letters. 2011, Vol 111, Num 7, pp 326-333, issn 0020-0190, 8 p.Article

Forbidden induced subgraphs for star-free graphsFUJISAWA, Jun; OTA, Katsuhiro; OZEKI, Yenta et al.Discrete mathematics. 2011, Vol 311, Num 21, pp 2475-2484, issn 0012-365X, 10 p.Article